An Edge Based Architecture for Managing Uncooperative Flows in the Internet

نویسندگان

  • Kartikeya Chandrayana
  • Shivkumar Kalyanaraman
چکیده

An Edge Based Architecture for Managing Uncooperative Flows in the Internet Kartikeya Chandrayana, Cisco Systems, San Jose, CA, [email protected] Shivkumar Kalyanaraman, R.P.I., Troy, NY, [email protected] Abstract— Traditionally uncooperative rate control schemes have implied open loop protocols such as UDP, CBR. In this paper we show that closed loop uncooperative rate control schemes also exist and that the current AQM proposals cannot efficiently control their mis-behavior. Moreover, these proposals require that AQM be installed at all routers in the Internet which is not only expensive but requires significant network upgrade. In this paper we show that management of uncooperative flows need not be coupled with AQM design but can be viewed as edge based policing question. In this paper we propose an analytical model for managing uncooperative flows in the Internet by re-mapping their utility function to a target range of utlity functions. This mapping can be achieved by transparently manipulating congestion penalties conveyed to the uncooperative users. The most interesting aspect of this research is that this task can be performed at the edge of the network with little state information about uncooperative flows. The proposed solution is independent of the buffer management algorithm deployed on the network. Thus the framework presented in this paper not only works on a network of Drop-Tail queues but also with any AQM scheme. We have analyzed the framework and evaluated it on various single and multi-bottleneck topologies with both Drop-Tail and RED. Our results show that the framework is robust and works well even in presence of background traffic and reverse path congestion. Traditionally uncooperative rate control schemes have implied open loop protocols such as UDP, CBR. In this paper we show that closed loop uncooperative rate control schemes also exist and that the current AQM proposals cannot efficiently control their mis-behavior. Moreover, these proposals require that AQM be installed at all routers in the Internet which is not only expensive but requires significant network upgrade. In this paper we show that management of uncooperative flows need not be coupled with AQM design but can be viewed as edge based policing question. In this paper we propose an analytical model for managing uncooperative flows in the Internet by re-mapping their utility function to a target range of utlity functions. This mapping can be achieved by transparently manipulating congestion penalties conveyed to the uncooperative users. The most interesting aspect of this research is that this task can be performed at the edge of the network with little state information about uncooperative flows. The proposed solution is independent of the buffer management algorithm deployed on the network. Thus the framework presented in this paper not only works on a network of Drop-Tail queues but also with any AQM scheme. We have analyzed the framework and evaluated it on various single and multi-bottleneck topologies with both Drop-Tail and RED. Our results show that the framework is robust and works well even in presence of background traffic and reverse path congestion.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Efficient Secret Sharing-based Storage System for Cloud-based Internet of Things

Internet of things (IoTs) is the newfound information architecture based on the internet that develops interactions between objects and services in a secure and reliable environment. As the availability of many smart devices rises, secure and scalable mass storage systems for aggregate data is required in IoTs applications. In this paper, we propose a new method for storing aggregate data in Io...

متن کامل

Adaptive marking for aggregated flows

Abstract— The differentiated services architecture is receiving wide attention as a framework for providing different levels of service according to a service profile in the Internet. The current architecture allows aggregated flows sharing a service profile. This paper looks at the problem of achieving specific QoS goals of individual flows by flexibly managing resources available to an aggreg...

متن کامل

An Abstract Framework for Managing Non-Cooperative Flows in Congested Inter-Networks

In this paper we propose an analytical model for managing non-cooperative or mis-behaving flows in the Internet by manipulating congestion penalties conveyed to them. We show that a penalty transformation derived from the Duality formulation of Utility Maximization problem can map a user’s utility function, , to any objective utility function, . These penalty transformation modules can be compl...

متن کامل

Internet network design for quality of service guarantee using Data Envelopment Analysis (DEA)

By developing the new services such as VoIP and Videoconference, using a mechanism is needed to support the quality of service of the application programs. Different models have been presented to guarantee the quality of service. Among these, the differentiated services can be mentioned which was presented by IETF. In the architecture of the differentiated services, no admission control mechani...

متن کامل

Deterministic Edge-to-Edge Delay Bounds for a Flow under Latency Rate Scheduling in a DiffServ Network

With the occurrence of new applications such as Voice over IP (VoIP) and multimedia conference, there is an ongoing discussion about realizing QoS in the Internet today. Because of its potential scalability in support of QoS guarantees, the Differentiated Service (DiffServ) architecture with aggregate packet scheduling has recently attracted much attention in the networking community as a feasi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005